A Refinement of de Bruijn's Formal Language of Mathematics
نویسندگان
چکیده
Abstract. We provide a syntax and a derivation system for a formal language of mathematics called Weak Type Theory (WTT). We give the metatheory of WTT and a number of illustrative examples. WTT is a refinement of de Bruijn’s Mathematical Vernacular (MV) and hence: WTT is faithful to the mathematician’s language yet is formal and avoids ambiguities. WTT is close to the usual way in which mathematicians express themselves in writing. WTT has a syntax based on linguistic categories instead of set/type theoretic constructs.
منابع مشابه
Software Specification Refinement and Verification Method with I-Mathic Studio
A software design usually manifests a composition of software specifications. It consists of hierarchies of black box and white box specifications which are subject to refinement verification. Refinement verification is a modelchecking process that proves the correctness of software specifications using formal methods. Although this is a powerful tool for developing reliable and robust software...
متن کاملVPM: Mathematics of Metamodeling is Metamodeling Mathematics
As UML 2.0 is evolving into a family of languages with individually specified semantics, there is an increasing need for automated and provenly correct model transformations that (i) assure the integration of local views (different diagrams) of the system into a consistent global view, and, (ii) provide a well–founded mapping from UML models to different semantic domains (Petri nets, Kripke aut...
متن کاملBehavioral Refinement of Software Architectures
Formal methods are mathematical techniques which aim at introducing sound engineering principles into software development. Especially in early development phases, where the overall structure of a software system — also called its software architecture — is designed, formal methods help to avoid errors. Therefore, a lot of formal methods based research has been and still is undertaken in the fi...
متن کاملA bijection from ordered trees to binary trees that sends the pruning order to the strahler number
It is well known (e.g. [3], p. 60) that the number of ordered trees with n vertices equals the number of complete binary trees with n leaves. Vauchaussade de Chaumont and Viennot [4,6] ( see also [3], ch. 3, ex. 6 (p. 103)) discovered an interesting refinement of this fact. They proved that for any integers n and k, the number of ordered trees with IZ vertices and pruning order k equals the num...
متن کاملD'Event-B vers UML/OCL en passant par UML/EM-OCL
Pour surmonter les limites inhérentes aux deux approches classique et formelle de développement des logiciels complexes, nous avons proposé une approche hybride combinant l'approche formelle (Event-B) et l'approche classique (UML/OCL). Les phases en amont de notre approche comportent : Réécriture du cahier des charges, Stratégie de raffinement, Spécification abstraite et Raffinement horizontal....
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- Journal of Logic, Language and Information
دوره 13 شماره
صفحات -
تاریخ انتشار 2004